0.12/0.15	% Problem    : Vampire---4.8_31919 : TPTP v0.0.0. Released v0.0.0.
0.12/0.16	% Command    : run_E %s %d THM
0.16/0.37	% Computer : n012.cluster.edu
0.16/0.37	% Model    : x86_64 x86_64
0.16/0.37	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.16/0.37	% Memory   : 8042.1875MB
0.16/0.37	% OS       : Linux 3.10.0-693.el7.x86_64
0.16/0.37	% CPULimit   : 1440
0.16/0.37	% WCLimit    : 180
0.16/0.37	% DateTime   : Mon Jul  3 12:51:07 EDT 2023
0.16/0.37	% CPUTime    : 
0.22/0.57	Running higher-order theorem provingRunning: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.X7qJ44e7s9/Vampire---4.8_31919
0.41/0.57	# Version: 3.1pre001-ho
0.41/0.60	# Preprocessing class: HSLMSMSSLLLCHSA.
0.41/0.60	# Scheduled 6 strats onto 8 cores with 180 seconds (1440 total)
0.41/0.60	# Starting lpo1_fix with 540s (3) cores
0.41/0.60	# Starting full_lambda_9 with 180s (1) cores
0.41/0.60	# Starting almost_fo_4 with 180s (1) cores
0.41/0.60	# Starting new_ho_9 with 180s (1) cores
0.41/0.60	# Starting pre_casc_4 with 180s (1) cores
0.41/0.60	# Starting ho_unfolding_6 with 180s (1) cores
0.41/0.60	# pre_casc_4 with pid 32214 completed with status 0
0.41/0.60	# Result found by pre_casc_4
0.41/0.60	# Preprocessing class: HSLMSMSSLLLCHSA.
0.41/0.60	# Scheduled 6 strats onto 8 cores with 180 seconds (1440 total)
0.41/0.60	# Starting lpo1_fix with 540s (3) cores
0.41/0.60	# Starting full_lambda_9 with 180s (1) cores
0.41/0.60	# Starting almost_fo_4 with 180s (1) cores
0.41/0.60	# Starting new_ho_9 with 180s (1) cores
0.41/0.60	# Starting pre_casc_4 with 180s (1) cores
0.41/0.60	# SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
0.41/0.60	# Search class: HGUSM-FFMM31-DHSMMSBN
0.41/0.60	# partial match(3): HGHSM-FFMM31-SHSSMSBN
0.41/0.60	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.41/0.60	# Starting new_ho_10 with 98s (1) cores
0.41/0.60	# new_ho_10 with pid 32216 completed with status 0
0.41/0.60	# Result found by new_ho_10
0.41/0.60	# Preprocessing class: HSLMSMSSLLLCHSA.
0.41/0.60	# Scheduled 6 strats onto 8 cores with 180 seconds (1440 total)
0.41/0.60	# Starting lpo1_fix with 540s (3) cores
0.41/0.60	# Starting full_lambda_9 with 180s (1) cores
0.41/0.60	# Starting almost_fo_4 with 180s (1) cores
0.41/0.60	# Starting new_ho_9 with 180s (1) cores
0.41/0.60	# Starting pre_casc_4 with 180s (1) cores
0.41/0.60	# SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
0.41/0.60	# Search class: HGUSM-FFMM31-DHSMMSBN
0.41/0.60	# partial match(3): HGHSM-FFMM31-SHSSMSBN
0.41/0.60	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.41/0.60	# Starting new_ho_10 with 98s (1) cores
0.41/0.60	# Preprocessing time       : 0.004 s
0.41/0.60	# Presaturation interreduction done
0.41/0.60	
0.41/0.60	# Proof found!
0.41/0.60	# SZS status Theorem
0.41/0.60	# SZS output start CNFRefutation
0.41/0.60	thf(decl_22, type, is_of: $i > ($i > $o) > $o).
0.41/0.60	thf(decl_23, type, all_of: ($i > $o) > ($i > $o) > $o).
0.41/0.60	thf(decl_25, type, in: $i > $i > $o).
0.41/0.60	thf(decl_61, type, imp: $o > $o > $o).
0.41/0.60	thf(decl_62, type, d_not: $o > $o).
0.41/0.60	thf(decl_67, type, l_or: $o > $o > $o).
0.41/0.60	thf(decl_72, type, l_some: $i > ($i > $o) > $o).
0.41/0.60	thf(decl_77, type, e_is: $i > $i > $i > $o).
0.41/0.60	thf(decl_123, type, nat: $i).
0.41/0.60	thf(decl_124, type, n_is: $i > $i > $o).
0.41/0.60	thf(decl_127, type, n_some: ($i > $o) > $o).
0.41/0.60	thf(decl_142, type, n_pl: $i > $i > $i).
0.41/0.60	thf(decl_147, type, diffprop: $i > $i > $i > $o).
0.41/0.60	thf(decl_148, type, d_29_ii: $i > $i > $o).
0.41/0.60	thf(decl_149, type, iii: $i > $i > $o).
0.41/0.60	thf(decl_151, type, moreis: $i > $i > $o).
0.41/0.60	thf(decl_152, type, lessis: $i > $i > $o).
0.41/0.60	thf(decl_154, type, esk1_0: $i).
0.41/0.60	thf(decl_155, type, esk2_0: $i).
0.41/0.60	thf(def_e_is, axiom, ((e_is)=(^[X1:$i, X60:$i, X61:$i]:(((X60)=(X61))))), file('/export/starexec/sandbox2/tmp/tmp.X7qJ44e7s9/Vampire---4.8_31919', def_e_is)).
0.41/0.60	thf(def_diffprop, axiom, ((diffprop)=(^[X1:$i, X183:$i, X4:$i]:((n_is @ X1 @ (n_pl @ X183 @ X4))))), file('/export/starexec/sandbox2/tmp/tmp.X7qJ44e7s9/Vampire---4.8_31919', def_diffprop)).
0.41/0.60	thf(def_n_is, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), file('/export/starexec/sandbox2/tmp/tmp.X7qJ44e7s9/Vampire---4.8_31919', def_n_is)).
0.41/0.60	thf(def_d_not, axiom, ((d_not)=(^[X36:$o]:((imp @ ((X36)) @ (~($true)))))), file('/export/starexec/sandbox2/tmp/tmp.X7qJ44e7s9/Vampire---4.8_31919', def_d_not)).
0.41/0.60	thf(def_imp, axiom, ((imp)=(^[X34:$o, X35:$o]:(((X34)=>(X35))))), file('/export/starexec/sandbox2/tmp/tmp.X7qJ44e7s9/Vampire---4.8_31919', def_imp)).
0.41/0.60	thf(def_d_29_ii, axiom, ((d_29_ii)=(^[X1:$i, X184:$i]:((n_some @ (diffprop @ X1 @ X184))))), file('/export/starexec/sandbox2/tmp/tmp.X7qJ44e7s9/Vampire---4.8_31919', def_d_29_ii)).
0.41/0.60	thf(def_l_or, axiom, ((l_or)=(^[X42:$o]:(imp @ ((d_not @ ((X42))))))), file('/export/starexec/sandbox2/tmp/tmp.X7qJ44e7s9/Vampire---4.8_31919', def_l_or)).
0.41/0.60	thf(def_iii, axiom, ((iii)=(^[X1:$i, X185:$i]:((n_some @ (diffprop @ X185 @ X1))))), file('/export/starexec/sandbox2/tmp/tmp.X7qJ44e7s9/Vampire---4.8_31919', def_iii)).
0.41/0.60	thf(def_all_of, axiom, ((all_of)=(^[X3:$i > $o, X2:$i > $o]:(![X4:$i]:(((is_of @ X4 @ X3)=>(X2 @ X4)))))), file('/export/starexec/sandbox2/tmp/tmp.X7qJ44e7s9/Vampire---4.8_31919', def_all_of)).
0.41/0.60	thf(def_is_of, axiom, ((is_of)=(^[X1:$i, X2:$i > $o]:((X2 @ X1)))), file('/export/starexec/sandbox2/tmp/tmp.X7qJ44e7s9/Vampire---4.8_31919', def_is_of)).
0.41/0.60	thf(def_moreis, axiom, ((moreis)=(^[X1:$i, X187:$i]:((l_or @ ((d_29_ii @ X1 @ X187)) @ ((n_is @ X1 @ X187)))))), file('/export/starexec/sandbox2/tmp/tmp.X7qJ44e7s9/Vampire---4.8_31919', def_moreis)).
0.41/0.60	thf(def_n_some, axiom, ((n_some)=(l_some @ nat)), file('/export/starexec/sandbox2/tmp/tmp.X7qJ44e7s9/Vampire---4.8_31919', def_n_some)).
0.41/0.60	thf(def_lessis, axiom, ((lessis)=(^[X1:$i, X188:$i]:((l_or @ ((iii @ X1 @ X188)) @ ((n_is @ X1 @ X188)))))), file('/export/starexec/sandbox2/tmp/tmp.X7qJ44e7s9/Vampire---4.8_31919', def_lessis)).
0.41/0.60	thf(satz13, conjecture, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X204:$i]:((in @ X204 @ nat))) @ (^[X205:$i]:(((moreis @ X1 @ X205)=>(lessis @ X205 @ X1)))))))), file('/export/starexec/sandbox2/tmp/tmp.X7qJ44e7s9/Vampire---4.8_31919', satz13)).
0.41/0.60	thf(c_0_14, plain, ((e_is)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:(((Z1)=(Z2))))), inference(fof_simplification,[status(thm)],[def_e_is])).
0.41/0.60	thf(c_0_15, plain, ((diffprop)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:((((Z0)=(n_pl @ Z1 @ Z2)))))), inference(fof_simplification,[status(thm)],[def_diffprop])).
0.41/0.60	thf(c_0_16, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), inference(apply_def,[status(thm)],[def_n_is, c_0_14])).
0.41/0.60	thf(c_0_17, plain, ((d_not)=(^[Z0/* 3 */:$o]:(((((Z0))=>(~($true))))))), inference(fof_simplification,[status(thm)],[def_d_not])).
0.41/0.60	thf(c_0_18, plain, ((imp)=(^[Z0/* 19 */:$o, Z1:$o]:(((Z0)=>(Z1))))), inference(fof_simplification,[status(thm)],[def_imp])).
0.41/0.60	thf(c_0_19, plain, ((d_29_ii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (^[Z2/* 3 */:$i]:((((Z0)=(n_pl @ Z1 @ Z2))))))))), inference(fof_simplification,[status(thm)],[def_d_29_ii])).
0.41/0.60	thf(c_0_20, plain, ((diffprop)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:((((Z0)=(n_pl @ Z1 @ Z2)))))), inference(apply_def,[status(thm)],[c_0_15, c_0_16])).
0.41/0.60	thf(c_0_21, plain, ((l_or)=(^[Z0/* 19 */:$o, Z1:$o]:((((((((Z0)))=>(~($true)))))=>(Z1))))), inference(fof_simplification,[status(thm)],[def_l_or])).
0.41/0.60	thf(c_0_22, plain, ((d_not)=(^[Z0/* 3 */:$o]:(((((Z0))=>(~($true))))))), inference(apply_def,[status(thm)],[c_0_17, c_0_18])).
0.41/0.60	thf(c_0_23, plain, ((iii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (^[Z2/* 3 */:$i]:((((Z1)=(n_pl @ Z0 @ Z2))))))))), inference(fof_simplification,[status(thm)],[def_iii])).
0.41/0.60	thf(c_0_24, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(fof_simplification,[status(thm)],[def_all_of])).
0.41/0.60	thf(c_0_25, plain, ((is_of)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((Z1 @ Z0)))), inference(fof_simplification,[status(thm)],[def_is_of])).
0.41/0.60	thf(c_0_26, plain, ((moreis)=(^[Z0/* 19 */:$i, Z1:$i]:(((((((((((l_some @ nat @ (^[Z2/* 3 */:$i]:((((Z0)=(n_pl @ Z1 @ Z2))))))))))=>(~($true)))))=>((((Z0)=(Z1))))))))), inference(fof_simplification,[status(thm)],[def_moreis])).
0.41/0.60	thf(c_0_27, plain, ((d_29_ii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (^[Z2/* 3 */:$i]:((((Z0)=(n_pl @ Z1 @ Z2))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_19, c_0_20]), def_n_some])).
0.41/0.60	thf(c_0_28, plain, ((l_or)=(^[Z0/* 19 */:$o, Z1:$o]:((((((((Z0)))=>(~($true)))))=>(Z1))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_21, c_0_22]), c_0_18])).
0.41/0.60	thf(c_0_29, plain, ((lessis)=(^[Z0/* 19 */:$i, Z1:$i]:(((((((((((l_some @ nat @ (^[Z2/* 3 */:$i]:((((Z1)=(n_pl @ Z0 @ Z2))))))))))=>(~($true)))))=>((((Z0)=(Z1))))))))), inference(fof_simplification,[status(thm)],[def_lessis])).
0.41/0.60	thf(c_0_30, plain, ((iii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (^[Z2/* 3 */:$i]:((((Z1)=(n_pl @ Z0 @ Z2))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_23, c_0_20]), def_n_some])).
0.41/0.60	thf(c_0_31, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(apply_def,[status(thm)],[c_0_24, c_0_25])).
0.41/0.60	thf(c_0_32, plain, ((moreis)=(^[Z0/* 19 */:$i, Z1:$i]:(((((((((((l_some @ nat @ (^[Z2/* 3 */:$i]:((((Z0)=(n_pl @ Z1 @ Z2))))))))))=>(~($true)))))=>((((Z0)=(Z1))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_26, c_0_27]), c_0_16]), c_0_28])).
0.41/0.60	thf(c_0_33, plain, ((lessis)=(^[Z0/* 19 */:$i, Z1:$i]:(((((((((((l_some @ nat @ (^[Z2/* 3 */:$i]:((((Z1)=(n_pl @ Z0 @ Z2))))))))))=>(~($true)))))=>((((Z0)=(Z1))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_29, c_0_30]), c_0_16]), c_0_28])).
0.41/0.60	thf(c_0_34, negated_conjecture, ~(![X289:$i]:(((in @ X289 @ nat)=>![X288:$i]:(((in @ X288 @ nat)=>((~(l_some @ nat @ (^[Z0/* 3 */:$i]:(((X289)=(n_pl @ X288 @ Z0)))))=>((X289)=(X288)))=>(~(l_some @ nat @ (^[Z0/* 3 */:$i]:(((X289)=(n_pl @ X288 @ Z0)))))=>((X288)=(X289))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz13])]), c_0_31]), c_0_32]), c_0_33])])).
0.41/0.60	thf(c_0_35, negated_conjecture, ((in @ esk1_0 @ nat)&((in @ esk2_0 @ nat)&(((l_some @ nat @ (^[Z0/* 3 */:$i]:(((esk1_0)=(n_pl @ esk2_0 @ Z0)))))|((esk1_0)=(esk2_0)))&(~(l_some @ nat @ (^[Z0/* 3 */:$i]:(((esk1_0)=(n_pl @ esk2_0 @ Z0)))))&((esk2_0)!=(esk1_0)))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])])])).
0.41/0.60	thf(c_0_36, negated_conjecture, ((l_some @ nat @ (^[Z0/* 3 */:$i]:(((esk1_0)=(n_pl @ esk2_0 @ Z0)))))|((esk1_0)=(esk2_0))), inference(split_conjunct,[status(thm)],[c_0_35])).
0.41/0.60	thf(c_0_37, negated_conjecture, ((esk2_0)!=(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_35])).
0.41/0.60	thf(c_0_38, negated_conjecture, ~((l_some @ nat @ (^[Z0/* 3 */:$i]:(((esk1_0)=(n_pl @ esk2_0 @ Z0)))))), inference(split_conjunct,[status(thm)],[c_0_35])).
0.41/0.60	thf(c_0_39, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_36, c_0_37]), c_0_38]), ['proof']).
0.41/0.60	# SZS output end CNFRefutation
0.41/0.60	# Parsed axioms                        : 349
0.41/0.60	# Removed by relevancy pruning/SinE    : 289
0.41/0.60	# Initial clauses                      : 94
0.41/0.60	# Removed in clause preprocessing      : 7
0.41/0.60	# Initial clauses in saturation        : 87
0.41/0.60	# Processed clauses                    : 13
0.41/0.60	# ...of these trivial                  : 0
0.41/0.60	# ...subsumed                          : 0
0.41/0.60	# ...remaining for further processing  : 12
0.41/0.60	# Other redundant clauses eliminated   : 0
0.41/0.60	# Clauses deleted for lack of memory   : 0
0.41/0.60	# Backward-subsumed                    : 0
0.41/0.60	# Backward-rewritten                   : 0
0.41/0.60	# Generated clauses                    : 0
0.41/0.60	# ...of the previous two non-redundant : 0
0.41/0.60	# ...aggressively subsumed             : 0
0.41/0.60	# Contextual simplify-reflections      : 0
0.41/0.60	# Paramodulations                      : 0
0.41/0.60	# Factorizations                       : 0
0.41/0.60	# NegExts                              : 0
0.41/0.60	# Equation resolutions                 : 0
0.41/0.60	# Total rewrite steps                  : 1
0.41/0.60	# Propositional unsat checks           : 0
0.41/0.60	#    Propositional check models        : 0
0.41/0.60	#    Propositional check unsatisfiable : 0
0.41/0.60	#    Propositional clauses             : 0
0.41/0.60	#    Propositional clauses after purity: 0
0.41/0.60	#    Propositional unsat core size     : 0
0.41/0.60	#    Propositional preprocessing time  : 0.000
0.41/0.60	#    Propositional encoding time       : 0.000
0.41/0.60	#    Propositional solver time         : 0.000
0.41/0.60	#    Success case prop preproc time    : 0.000
0.41/0.60	#    Success case prop encoding time   : 0.000
0.41/0.60	#    Success case prop solver time     : 0.000
0.41/0.60	# Current number of processed clauses  : 12
0.41/0.60	#    Positive orientable unit clauses  : 5
0.41/0.60	#    Positive unorientable unit clauses: 0
0.41/0.60	#    Negative unit clauses             : 4
0.41/0.60	#    Non-unit-clauses                  : 3
0.41/0.60	# Current number of unprocessed clauses: 74
0.41/0.60	# ...number of literals in the above   : 246
0.41/0.60	# Current number of archived formulas  : 0
0.41/0.60	# Current number of archived clauses   : 0
0.41/0.60	# Clause-clause subsumption calls (NU) : 0
0.41/0.60	# Rec. Clause-clause subsumption calls : 0
0.41/0.60	# Non-unit clause-clause subsumptions  : 0
0.41/0.60	# Unit Clause-clause subsumption calls : 0
0.41/0.60	# Rewrite failures with RHS unbound    : 0
0.41/0.60	# BW rewrite match attempts            : 0
0.41/0.60	# BW rewrite match successes           : 0
0.41/0.60	# Condensation attempts                : 13
0.41/0.60	# Condensation successes               : 0
0.41/0.60	# Termbank termtop insertions          : 11466
0.41/0.60	
0.41/0.60	# -------------------------------------------------
0.41/0.60	# User time                : 0.011 s
0.41/0.60	# System time              : 0.003 s
0.41/0.60	# Total time               : 0.014 s
0.41/0.60	# Maximum resident set size: 3004 pages
0.41/0.60	
0.41/0.60	# -------------------------------------------------
0.41/0.60	# User time                : 0.020 s
0.41/0.60	# System time              : 0.005 s
0.41/0.60	# Total time               : 0.025 s
0.41/0.60	# Maximum resident set size: 2208 pages
0.41/0.60	% E---3.1 exiting
0.41/0.60	EOF